

# 栈的实现  后进先出
stack_test = [1,2,3]
stack_test.append(666)
print(stack_test)
stack_test.pop()
print(stack_test)

# 队列的实现  先进先出
from collections import deque

deque_test = deque([9,8,7])
deque_test.append(666)
print(deque_test)
deque_test.popleft()
print(deque_test)
print(list(deque_test))
